Fast and Flexible Difference Constraint Propagation for DPLL(T)
نویسندگان
چکیده
In the context of DPLL(T), theory propagation is the process of dynamically selecting consequences of a conjunction of constraints from a given set of candidate constraints. We present improvements to a fast theory propagation procedure for difference constraints of the form x− y ≤ c. These improvements are demonstrated experimentally.
منابع مشابه
Integrating Simplex with DPLL ( T )
We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in the DPLL(T ) framework. The new solver improves over existing approaches by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form of theory propagation. We also present a new and simple approach for solving strict inequalities. Experi...
متن کاملA Fast Linear-Arithmetic Solver for DPLL(T)
We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in the DPLL(T ) framework. The new solver improves over existing approaches by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form of theory propagation. We also present a new and simple approach for solving strict inequalities. Experi...
متن کاملTheory propagation and reification
SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T , are composed with logical connectives. The DPLL(T ) approach to SMT has risen to prominence as a technique for solving these quantifier-free problems. The key idea in DPLL(T ) is to couple unit propagation in the propositional part of the problem...
متن کاملDPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
At CAV’04 we presented the DPLL(T ) approach for satisfiability modulo theories T . It is based on a general DPLL(X) engine whose X can be instantiated with different theory solvers Solver T for conjunctions of literals. Here we go one important step further: we require Solver T to be able to detect all input literals that are T -consequences of the partial model that is being explored by DPLL(...
متن کاملA Random Constraint Satisfaction Problem That Seems Hard for DPLL
This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so is easier to analyze. For example, the exact satisfiability threshold for this problem is known, and the problem has high resolution complexity. In this paper, we prove the problem appears hard for DPLL. Specifically, if we pick...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006